Batch scheduling of deteriorating reworkables

2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Batching in a two-stage flowshop with dedicated machines in the second stage

Author name used in this publication: T. C. E. ChengAuthor name used in this publication: M. Y. Kovalyov2003-2004 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

A survey of scheduling problems with setup times or costs

Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Group sequencing around a common due date

Author name used in this publication: C. T. Ng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Batch scheduling of step deteriorating jobs

Author name used in this publication: T. C. E. ChengAuthor name used in this publication: C. T. Ng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Single machine scheduling to minimize batch delivery and job earliness penalties

Version of RecordPublishe

Bicriterion single machine scheduling with resource dependent processing times

Version of RecordPublishe

Models and algorithms for energy-efficient scheduling with immediate start of jobs

We study a scheduling model with speed scaling for machines and the immediate start requirement for jobs. Speed scaling improves the system performance, but incurs the energy cost. The immediate start condition implies that each job should be started exactly at its release time. Such a condition is typical for modern Cloud computing systems with abundant resources. We consider two cost functions, one that represents the quality of service and the other that corresponds to the cost of running. We demonstrate that the basic scheduling model to minimize the aggregated cost function with n jobs is solvable in O(nlogn) time in the single-machine case and in O(n²m) time in the case of m parallel machines. We also address additional features, e.g., the cost of job rejection or the cost of initiating a machine. In the case of a single machine, we present algorithms for minimizing one of the cost functions subject to an upper bound on the value of the other, as well as for finding a Pareto-optimal solution

Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence

This paper addresses scheduling n jobs in a two-machine flow shop to minimize the total completion time, subject to the condition that the jobs are processed in the same given sequence on both machines. A new concept of optimal schedule block is introduced, and polynomial time dynamic programming algorithms employing this concept are derived for two specific problems. In the first problem, the machine-2 processing time of a job is a step increasing function of its waiting time between the machines, and a decision about machine-1 idle time insertion has to be made. This problem is solved in O( n2) time. In the second problem, the jobs are processed in batches and each batch is preceded by a machine-dependent setup time. An O( n5) algorithm is developed to find an optimal batching decision. © 2011 Elsevier B.V. All rights reserved